Strong stability in nonlinear programming revisited

Characterizations of Lipschitzian Stability in Nonlinear Programming

Nonlinear programming problems are analyzed for Lipschitz and upper-Lipschitz behavior of their solutions and stationary points under general perturbations. Facts from a diversity of sources are put together to obtain new characterizations of several local stability properties.

Hydrogen Distribution in Refinery with Nonlinear Programming

Numerical measure of strong stability and strong quasistability in the vector problem of integer linear programming

In this paper we consider a vector integer programming problem with the linear partial criteria. Numerical evaluations of two types of stability of the Pareto set have been found. Usually the stability (quasistability) of a vector optimization problem (see [1-10]) is understood as the property of nonappearance of new optimal solutions (preservation of initial) under small perturbations of the p...

Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification

The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish re...

Nonlinear stability of solitons against strong external perturbations.

We study soliton stability under the action of strong external perturbations. Limits on the weak perturbation approach are established with the help of average Lagrangian methods and full simulations. We found that for the same relative perturbation, larger amplitude solitons develop instability earlier than weaker amplitude solitons.